An infrastructure for debug using clusters of assertion-checkers

نویسندگان

  • Mohammad Hossein Neishaburi
  • Zeljko Zilic
چکیده

Article history: Received 5 August 2011 Received in revised form 19 April 2012 Accepted 20 April 2012 Available online xxxx 0026-2714/$ see front matter 2012 Elsevier Ltd. A http://dx.doi.org/10.1016/j.microrel.2012.04.016 ⇑ Corresponding author. Tel.: +1 5146793344. E-mail addresses: [email protected] [email protected] (Z. Zilic). Please cite this article in press as: Neishaburi M http://dx.doi.org/10.1016/j.microrel.2012.04.016 It has become indispensable to locate circuit defects and find the root-cause of errors as soon as the prototype of a system (first-silicon) gets ready. Various Design-for-Debug (DfD) solutions have been introduced as a means to increase the observability and controllability of internal signals, resulting to a speed-up in debugging process and a decrease in the time-to-market of new products. Assertion Based Verification (ABV) is one of the instrumental pre-silicon verification techniques. Once assertions are converted to hardware modules and incorporated into a debug infrastructure, the post-silicon debug can benefit from the additional observability provided by such assertions. In this paper, we first propose a new algorithm that generates clusters of assertion-checkers; in our proposed clustering algorithm, we resort to a graph partitioning algorithm to find the assertion-checkers that can be placed inside a cluster. The proposed method generates the clusters of assertion-checkers by means of exploring the logic-cones set of each assertion-checker. Moreover, coverage metrics for different configurations of clusters are defined. Then, we introduce several mechanisms through which the clusters of assertion-checkers can be incorporated into the DfD infrastructures. In our experiments, several case studies such as AXI bus, PCI bus protocol and a memory controller are considered; thereafter, the proposed debug infrastructure containing clusters of assertion-checkers is embedded into such case studies. It turns out that contrary to a non-clustering approach of placing assertion-checkers into a design the clustering algorithm along with the proposed method for incorporating assertion-checker clusters into a debug infrastructure lead to the better results in terms of the energy consumption and design coverage. 2012 Elsevier Ltd. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Chip is Ready. Am I done? On-chip Verification using Assertion Processors

White-box verification is a technique that reduces observability problems by locating a failure during design simulation without the need to propagate the failure to the I/O pins. White-box verification in chip level designs can be implemented using assertion checkers to ensure the correct behavior of a design. With chip gate counts growing exponentially, today’s verification techniques, such a...

متن کامل

On-Chip Property Verification Using Assertion Processors

White-box verification is a technique that reduces observability problems by locating a failure during design simulation without the need to propagate the failure to the I/O pins. White-box verification in chip level designs can be implemented using assertion checkers to ensure the correct behavior of a design. With chip gate counts growing exponentially, today's verification techniques, such a...

متن کامل

SILICON DEBUG AND DIAGNOSIS Debug enhancements in assertion-checker generation

Although assertions are a great tool for aiding debugging in the design and implementation verification stages, their use in silicon debug has been limited so far. A set of techniques for debugging with the assertions in either pre-silicon or post-silicon scenarios are discussed. Presented are features such as assertion threading, activity monitors, assertion and cover counters and completion m...

متن کامل

BON-CASE: An Extensible CASE Tool for Formal Specification and Reasoning

We describe BON-CASE, an extensible tool for the BON modelling language. The tool’s support for formal techniques – in particular, for formal specification of contracts and frames, as a platform for verification of Eiffel code, for lightweight integration with existing reasoning tools (such as type checkers, theorem provers, and static assertion checkers), and its extensible architecture – is d...

متن کامل

Modular Enforcement of Supertype Abstraction and Information Hiding with Client-Side Checking

Static reasoning tools for object-oriented (OO) languages use supertype abstraction, by verifying calls to methods using the specification associated with the receiver’s static type. Unfortunately, contemporary runtime assertion checkers for OO are inconsistent with such static reasoning tools, since they check assertions in an overly-dynamic way on the supplier side. For method calls, such sup...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Microelectronics Reliability

دوره 52  شماره 

صفحات  -

تاریخ انتشار 2012